New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

Authors

Hamid Davoudpour Department of Industrial Engineering and Management Systems, Amirkabir University of Technology (Tehran Polytechnics), 424 Hafez Avenue, Tehran, 15916-34311, Iran

Hamidreza Kia Department of Industrial Engineering and Management Systems, Amirkabir University of Technology (Tehran Polytechnics), 424 Hafez Avenue, Tehran, 15916-34311, Iran

Seyed Hassan Ghodsypour Department of Industrial Engineering and Management Systems, Amirkabir University of Technology (Tehran Polytechnics), 424 Hafez Avenue, Tehran, 15916-34311, Iran

Abstract:

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent setup times is studied. The objective of the problem is minimization of mean flow time and mean tardiness. A 0–1 mixed integer model of the problem is formulated. Since the problem is NP-hard, four new composite dispatching rules are proposed to solve it by applying genetic programming framework and choosing proper operators. Furthermore, a discrete-event simulation model is made to examine the performances of scheduling rules considering four new heuristic rules and the six adapted heuristic rules from the literature. It is clear from the experimental results that composite dispatching rules that are formed from genetic programming have a better performance in minimization of mean flow time and mean tardiness than others.

Upgrade to premium to download articles

Already have an account?login

similar resources

New Routing Rules for Dynamic Flexible Job Shop Scheduling with Sequence-Dependent Setup Times

Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admit...

full text

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

full text

Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times

full text

A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption

full text

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

full text

solving group scheduling problem in no-wait flow shop with sequence dependent setup times

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}

Journal title

Journal of Industrial Engineering, International

volume 13 issue 3

pages -

publication date 2017-09-01

unfollow

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Scheduling . Dynamic flexible flow line . Simulation . Heuristics . Genetic programming

Hosted on Doprax cloud platform doprax.com